Submodular Max-SAT
نویسندگان
چکیده
We introduce the submodular Max-SAT problem. This problem is a natural generalization of the classical Max-SAT problem in which the additive objective function is replaced by a submodular one. We develop a randomized linear-time 2/3-approximation algorithm for the problem. Our algorithm is applicable even for the online variant of the problem. We also establish hardness results for both the online and offline settings. Notably, for the online setting, the hardness result proves that our algorithm is best possible, while for the offline setting, the hardness result establishes a computational separation between the classical Max-SAT and the submodular Max-SAT. ∗Blavatnik School of Computer Science, Tel-Aviv University, Tel-Aviv 69978, Israel. Email: [email protected]. †Microsoft R&D Center, Herzliya 46725, Israel. Email: [email protected]. ‡Blavatnik School of Computer Science, Tel-Aviv University, Tel-Aviv 69978, Israel. Email: [email protected].
منابع مشابه
On Some Recent MAX SAT Approximation Algorithms
Recently a number of randomized 3 4 -approximation algorithms for MAX SAT have been proposed that all work in the same way: given a fixed ordering of the variables, the algorithm makes a random assignment to each variable in sequence, in which the probability of assigning each variable true or false depends on the current set of satisfied (or unsatisfied) clauses. To our knowledge, the first su...
متن کاملUnifying Local Consistency and MAX SAT Relaxations for Scalable Inference with Rounding Guarantees
We prove the equivalence of first-order local consistency relaxations and the MAX SAT relaxation of Goemans and Williamson (1994) for a class of MRFs we refer to as logical MRFs. This allows us to combine the advantages of each into a single MAP inference technique: solving the local consistency relaxation with any of a number of highly scalable message-passing algorithms, and then obtaining a ...
متن کاملOn the limitations of deterministic de-randomizations for online bipartite matching and max-sat
The surprising results of Karp, Vazirani and Vazirani [35] and (respectively) Buchbinder et al [15] are examples where rather simple randomization provides provably better approximations than the corresponding deterministic counterparts for online bipartite matching and (respectively) unconstrained non-monotone submodular. We show that seemingly strong extensions of the deterministic online com...
متن کاملRounding Guarantees for Message-Passing MAP Inference with Logical Dependencies
We present the equivalence of the first-order local consistency relaxation and the MAX SAT relaxation of Goemans and Williamson [1] for a class of MRFs we refer to as logical MRFs. This allows us to combine the advantages of both approaches into a single technique: solving the local consistency relaxation with any of a number of message-passing algorithms, and then improving the solution qualit...
متن کاملA Min-Max Theorem for k-submodular Functions and Extreme Points of the Associated Polyhedra
A. Huber and V. Kolmogorov (ISCO 2012) introduced a concept of k-submodular function as a generalization of ordinary submodular (set) functions and bisubmodular functions. They presented a min-max relation for the k-submodular function minimization by considering l1 norm, which requires a non-convex set of feasible solutions associated with the k-submodular function. Our approach overcomes the ...
متن کامل